Repeated Games with Finite Automata

Evolutionary Stability in Repeated Games Played by Finite Automata

We consider a game in which “meta-players” choose finite automata to play a repeated stage game. Meta-players’ utilities are lexicographic, first increasing in the (limit-of-the-means) payoffs of the repeated game and second decreasing in the number of states in their automaton. We examine the outcomes in this game which satisfy a version of evolutionary stability that has been modified to perm...

FINITELY REPEATED GAMES WITH FINITE AUTOMATA AB RAHAM NEYMAN In honor of R. J. Aumann's 65th birthday

The paper studies the implications of bounding the complexity of the strategies players may select, on the set of equilibrium payoffs in repeated games. The complexity of a strategy is measured by the size of the minimal automation that can implement it. A finite automation has a finite number of states and an initial state. It prescribes the action to be taken as a function of the current stat...

Perishable Inventory System with a Finite Population and Repeated Attempts

Repeated Games with Observation Costs

This paper analyzes repeated games in which it is possible for players to observe the other players’ past actions without noise but it is costly. One’s observation decision itself is not observable to the other players, and this private nature of monitoring activity makes it difficult to give the players proper incentives to monitor each other. We provide a sufficient condition for a feasible p...

Repeated Games with Asynchronous Monitoring

We study two modi…cations of the standard model of repeated games with public signals. In one modi…cation, players osberve an underlying public signal at random and privately known times, where the public signals are Poisson events and either the observations occur within a small epsilon time interval or the obsevations have an exponential waiting times. In the second modi…cation, the players o...